布尔函数的Walsh谱绝对值分布及其性质研究

提出并研究了布尔函数的Walsh谱绝对值分布.指出布尔函数Walsh谱绝对值分布在仿射变换下的不变性,计算了n(n≤5)元布尔函数的Walsh谱绝对值分布,研究了Walsh谱绝对值分布与Walsh谱支撑和Walsh谱中非零取值个数以及其他一些密码学难题的联系,最后研究了布尔函数的Walsh谱绝对值分布的大小.     

一种无人战斗机系统使用保障费用分析方法

基于无人战斗机系统在使用保障上的特点,通过对有人战斗机使用保障费用模型进行合理改造,使其能适用于无人战斗机的使用保障费用分析。经过改造的模型具有结构清晰、概念明确的特点。适合在飞机总体设计阶段用于全寿命周期的费用估算以及飞机的费效分析和综合优化设计。通过与有人战斗机的使用保障费用进行对比计算表明,无人战斗机系统的使用保障费用具有明显的经济优势。     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

对我军新型武器装备保障机制建设的几点思考

分析了我军新型武器装备保障机制建设面临的形势和存在的问题，提出了加强我军新型武器装备保障机制建设的对策和措施。建议从健全保障系统整体规划机制、完善保障资源配套机制和形成装备保障人才先行机制等方面加强建设，从而提高武器装备保障能力。     

关于半鞅向量随机积分的两个结果

首先利用半鞅Girsanov定理与闭图像定理证明了:若{Xn}是带滤基的完备概率空间(Ω,F,F,P)中的一列半鞅,其中滤基F=(Ft)t≥0满足通常条件,且{Xn}在关于P的Emery拓扑空间中收敛于X,则当概率测度Q相似文献   

基于AdaBoost-SVM的P2P流量识别方法

针对传统的P2P流量识别技术存在识别率低和误判率高的缺点,将机器学习中Ada Boost算法的良好分类能力和SVM的泛化能力结合起来,提出一种基于Ada Boost-SVM组合算法的P2P网络流量识别模型,将SVM作为Ada Boost的基分类器,运用最小近邻法计算支持向量与训练集的样本间的距离实现分类进行P2P流量识别。最后,以4种P2P流量数据为研究对象在MATLAB上进行仿真,仿真结果表明,提出的Ada Boost-SVM的组合算法在P2P网络流量的分类性能和分类准确率上都优于单纯的Ada Boost和SVM,组合算法的P2P流量平均识别率高达98.7%,远高于Ada Boost和SVM的识别率。     

基于ADC方法的通信装备保障效能评估

针对通信装备保障系统能力的评估问题,基于对经典评估算法的分析和对通信装备保障能力组成要素的研究,采用效能评估中经典并且目前常用的ADC方法,对通信装备保障系统能力进行效能评估建模与分析,确定了通信装备保障系统主要的能力指标以及影响因素,为通信装备保障系统及其组成装备的效能评估研究奠定基础、提供参考。通过对通信装备保障能力评估的研究,可以揭示构成通信装备保障能力诸要素间的本质联系,明确通信装备保障水平,提高通信装备保障能力。     

机器翻译中语义块汉英变换处理

首先解释了要素句蜕的内涵,同时介绍了HNC理论的句蜕观,并依据HNC句类理论提出了汉英机器翻译中,要素句蜕处理的具体规则,还结合真实语料进行了验证。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

使用融合乘加加速快速傅里叶变换计算的向量化方法

融合乘加指令加速快速傅里叶变换计算的向量化方法,通过变换快速傅里叶变换的蝶形单元运算流程,将传统计算方式中独立的乘法和加法操作组合成次数更少的融合乘加操作,使得时间抽取法基2快速傅里叶变换算法的蝶形单元计算的实数浮点操作由原来的10次乘(加)操作减少到6次融合乘加操作,时间抽取法基4快速傅里叶变换算法的蝶形单元计算的实数浮点操作由原来的34次乘(加)操作减少到24次融合乘加操作;优化了蝶形因子的向量访问,减少存储开销。实验结果表明,提出的方法能够显著加速快速傅里叶变换的计算,取得高效的计算性能和效率。